Min sum clustering with penaltiesHASSIN, Refael; OR, Einat.Lecture notes in computer science. 2005, pp 167-178, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Min sum clustering with penaltiesHASSIN, Refael; OR, Einat.European journal of operational research. 2010, Vol 206, Num 3, pp 547-554, issn 0377-2217, 8 p.Article

On two restricted ancestors tree problemsGUTTMANN-BECK, Nili; HASSIN, Refael.Information processing letters. 2010, Vol 110, Num 14-15, pp 570-575, issn 0020-0190, 6 p.Article

Scheduling Arrivals to Queues : A Single-Server Model with No-ShowsHASSIN, Refael; MENDEL, Sharon.Management science. 2008, Vol 54, Num 3, pp 565-572, issn 0025-1909, 8 p.Article

Approximation algorithms for quickest spanning tree problemsHASSIN, Refael; LEVIN, Asaf.Algorithmica. 2005, Vol 41, Num 1, pp 43-52, issn 0178-4617, 10 p.Article

The set cover with pairs problemHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2005, pp 164-176, issn 0302-9743, isbn 3-540-30495-9, 1Vol, 13 p.Conference Paper

Strategic Behavior and Social Optimization in Markovian Vacation QueuesPENGFEI GUO; HASSIN, Refael.Operations research. 2011, Vol 59, Num 4, pp 986-997, issn 0030-364X, 12 p.Article

Who should be given priority in a queue?HASSIN, Refael; HAVIV, Moshe.Operations research letters. 2006, Vol 34, Num 2, pp 191-198, issn 0167-6377, 8 p.Article

On the complexity of the κ-customer vehicle routing problemHASSIN, Refael; RUBINSTEIN, Shlomi.Operations research letters. 2005, Vol 33, Num 1, pp 71-76, issn 0167-6377, 6 p.Article

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersectionHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 261-268, issn 0097-5397, 8 p.Article

A 7/8-approximation algorithm for metric Max TSPHASSIN, Refael; RUBINSTEIN, Shlomi.Information processing letters. 2002, Vol 81, Num 5, pp 247-251, issn 0020-0190Article

z-ApproximationsHASSIN, Refael; KHULLER, Samir.Journal of algorithms (Print). 2001, Vol 41, Num 2, pp 429-442, issn 0196-6774Article

Flow trees for vertex-capacitated networksHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2007, Vol 155, Num 4, pp 572-578, issn 0166-218X, 7 p.Article

Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customersPENGFEI GUO; HASSIN, Refael.European journal of operational research. 2012, Vol 222, Num 2, pp 278-286, issn 0377-2217, 9 p.Article

Machine scheduling with earliness, tardiness and non-execution penaltiesHASSIN, Refael; SHANI, Mati.Computers & operations research. 2005, Vol 32, Num 3, pp 683-705, issn 0305-0548, 23 p.Article

Minimum restricted diameter spanning treesHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2004, Vol 137, Num 3, pp 343-357, issn 0166-218X, 15 p.Article

A note on orientations of mixed graphsARKIN, Esther M; HASSIN, Refael.Discrete applied mathematics. 2002, Vol 116, Num 3, pp 271-278, issn 0166-218XArticle

Approximation algorithms for constructing wavelength routing networksHASSIN, Refael; LEVIN, Asaf.Networks (New York, NY). 2002, Vol 40, Num 1, pp 32-37, issn 0028-3045Article

Multi-Color Pebble Motion on GraphsGORALY, Gilad; HASSIN, Refael.Algorithmica. 2010, Vol 58, Num 3, pp 610-636, issn 0178-4617, 27 p.Article

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSPHASSIN, Refael; KEINAN, Ariel.Operations research letters. 2008, Vol 36, Num 2, pp 243-246, issn 0167-6377, 4 p.Article

Rounding to an integral programHASSIN, Refael; SEGEV, Danny.Operations research letters. 2008, Vol 36, Num 3, pp 321-326, issn 0167-6377, 6 p.Article

A better-than-greedy approximation algorithm for the minimum set cover problemHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 189-200, issn 0097-5397, 12 p.Article

An approximation algorithm for maximum triangle packingHASSIN, Refael; RUBINSTEIN, Shlomi.Discrete applied mathematics. 2006, Vol 154, Num 6, pp 971-979, issn 0166-218X, 9 p.Article

Subgraphs decomposable into two trees and k-edge-connected subgraphsHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2003, Vol 126, Num 2-3, pp 181-195, issn 0166-218X, 15 p.Article

Robust matchingsHASSIN, Refael; RUBINSTEIN, Shlomi.SIAM journal on discrete mathematics (Print). 2002, Vol 15, Num 4, pp 530-537, issn 0895-4801, 8 p.Article